package algorithm;

import java.util.Scanner;

/**
 * 对数阶 - O(logN)
 */
public class Demo6 {
    public static void main(String[] args) {
        int count = 1;
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        while(count < n) {
            count = count * 2;
            // 时间复杂度为 O(1) 的程序步骤序列
        }
    }
}
